#include<iostream>
using namespace std;
const int N = 35;
int f[N][N];
int n, m;
int main()
{
	cin >> n >> m;
	if (n % 2 == 0 && m % 2 == 0) {
		cout << 0 << endl;
		return 0;
	}
	f[1][1] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (i == 1 && j == 1) {
				continue;
			}
			/*if (i % 2 == 0 && j % 2 == 0) {
				continue;
			}
			f[i][j] = f[i - 1][j] + f[i][j - 1];*/
			if (i % 2 || j % 2) {
				f[i][j] = f[i - 1][j] + f[i][j - 1];
			}
		}
	}
	cout << f[n][m] << endl;
	return 0;
}